منابع مشابه
Orthosymmetric block rotations
Rotations are essential transformations in many parts of numerical linear algebra. In this paper, it is shown that there exists a family of matrices unitary with respect to an orthosymmetric scalar product J , that can be decomposed into the product of two J-unitary matrices—a block diagonal matrix and an orthosymmetric block rotation. This decomposition can be used for computing various one-si...
متن کاملEla Orthosymmetric Block Rotations
Rotations are essential transformations in many parts of numerical linear algebra. In this paper, it is shown that there exists a family of matrices unitary with respect to an orthosymmetric scalar product J , that can be decomposed into the product of two J-unitary matrices—a block diagonal matrix and an orthosymmetric block rotation. This decomposition can be used for computing various one-si...
متن کاملH ¨ Older Type Inequalities for Orthosymmetric Bilinear Operators 1
The homogeneous functional calculus on vector lattices is a useful tool in a variety of areas. One of the interesting application is the study of powers of Banach lattices initiated by G. Ya. Lozanovskĭı [18]. Recently G. Buskes and A. van Rooij [8] introduced the concept of squares of Archimedean vector lattices which allows to represent orthoregular bilinear operators as linear regular operat...
متن کاملLearning Rotations Learning rotations with little regret
We describe online algorithms for learning a rotation from pairs of unit vectors in R. We show that the expected regret of our online algorithm compared to the best fixed rotation chosen offline over T iterations is O( √ nT ). We also give a lower bound that proves that this expected regret bound is optimal within a constant factor. This resolves an open problem posed in COLT 2008. Our online a...
متن کاملA Global Convergence Proof for Cyclic Jacobi Methods with Block Rotations
This paper introduces a globally convergent block (column– and row–) cyclic Jacobi method for diagonalization of Hermitian matrices and for computation of the singular value decomposition of general matrices. It is shown that a block rotation (generalization of the Jacobi’s 2× 2 rotation) must be computed and implemented in a particular way to guarantee global convergence. This solves a long st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2012
ISSN: 1081-3810
DOI: 10.13001/1081-3810.1523